Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative Decoding
نویسندگان
چکیده
منابع مشابه
Iterative Decoding of Low-Density Parity Check Codes (A Survey)
Much progress has been made on decoding algorithms for error-correcting codes in the last decade. In this article, we give an introduction to some fundamental results on iterative, message-passing algorithms for low-density parity check codes. For certain important stochastic channels, this line of work has enabled getting very close to Shannon capacity with algorithms that are extremely effici...
متن کاملIterative reliability-based decoding of low-density parity check codes
In this paper, reliability based decoding is combined with belief propagation (BP) decoding for low-density parity check (LDPC) codes. At each iteration, the soft output values delivered by the BP algorithm are used as reliability values to perform reduced complexity soft decision decoding of the code considered. This approach allows to bridge the error performance gap between belief propagatio...
متن کاملEarly Decision Decoding Methods for Low-Density Parity-Check Codes
Low-density parity-check codes have recently received extensive attention as a forward error correction scheme in a wide area of applications. The decoding algorithm is inherently parallelizable, allowing communication at high speeds. One of the main disadvantages, however, is large memory requirements for interim storing of decoding data. In this paper, we investigate a modification to the dec...
متن کاملLow-Density Parity-Check Codes: Constructions and Bounds
Low-density parity-check (LDPC) codes were introduced in 1962, but were almost forgotten. The introduction of turbo-codes in 1993 was a real breakthrough in communication theory and practice, due to their practical effectiveness. Subsequently, the connections between LDPC and turbo codes were considered, and it was shown that the latter can be described in the framework of LDPC codes. In recent...
متن کاملAn Iterative Decoding Algorithm of Low Density Parity Check Codes for Hidden Markov Noise Channels
An iterative decoding algorithm of low density parity check(LDPC) codes for hidden Markov noise channels is presented. The hidden Markov noise channel is an additive noise channel whose noise statistics is modeled by a hidden Markov model(HMM). The proposed decoding algorithm consists of two parts: the conventional sum-product algorithm for the LDPC codes and a forward-backward likelihood estim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2004
ISSN: 0018-9448
DOI: 10.1109/tit.2004.828066